An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections

نویسندگان

  • Andrea Frosini
  • Simone Rinaldi
  • Elena Barcucci
  • Attila Kuba
چکیده

This paper studies the classical tomographical problem of the reconstruction of a binary matrix from projections in presence of absorption. In particular, we consider two projections along the horizontal and vertical directions and the mathematically interesting case of the absorption coefficient β0 = 1+ √ 5 2 . After proving some theoretical results on the switching components, we furnish a fast algorithm for solving the reconstruction problem from the horizontal and vertical absorbed projections. As a significative remark, we obtain also the solution of the related uniqueness problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Study of Reconstructing hv-Convex Binary Matrices from Horizontal and Vertical Projections

The reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NPhard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of...

متن کامل

An introductive analysis of Periodical Discrete Sets from a tomographical point of view

In this paper we introduce a new class of binary matrices whose entries show periodical configurations, and we furnish a first approach to their analysis from a tomographical point of view. In particular we propose a polynomial-time algorithm for reconstructing matrices with a special periodical behavior from their horizontal and vertical projections. We succeeded in our aim by using reductions...

متن کامل

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem

This paper deals with the reconstruction of binary matrices having exactly-1-4-neighborhood constraints from the horizontal and vertical projections. This problem is shown to be NP-hard by means of a reduction which involve the NP-hard problem 3-color.

متن کامل

DISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

متن کامل

An introduction to periodical discrete sets from a tomographical perspective

In this paper we introduce a new class of binary matrices whose entries show periodical configurations, and we furnish a first approach to their analysis from a tomographical point of view. In particular we propose a polynomial-time algorithm for reconstructing matrices with a special periodical behavior from their horizontal and vertical projections. We succeeded in our aim by using a reductio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2005